Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
نویسندگان
چکیده
منابع مشابه
The Three-Dimensional Bin Packing Problem
The problem addressed in this paper is that of orthogonally packing a given set of rectangular-shaped items into the minimum number of three-dimensional rectangular bins. The problem is strongly NP-hard and extremely diicult to solve in practice. Lower bounds are discussed, and it is proved that the asymptotic worst-case performance ratio of the continuous lower bound is 1 8. An exact algorithm...
متن کاملThree-dimensional bin packing problem with variable bin height
This paper studies a variant of the three-dimensional bin packing problem (3D-BPP), where the bin height can be adjusted to the cartons it packs. The bins and cartons to be packed are assumed rectangular in shape. The cartons are allowed to be rotated into any one of the six positions that keep the carton edges parallel to the bin edges. This greatly increases the difficulty of finding a good s...
متن کاملThree dimensional Bin Packing Problem applied to air transport
Packing boxes into containers is a daily process in many different fields and especially in transport. However, the particular case of air transport brings some new constraints such as the stability or the fragility of the cargo. The distribution of the weight has also to be considered. Moreover, this special case also brings some data such as the dimensions of the possible containers, called U...
متن کاملVariants of Classical One-Dimensional Bin Packing
Joseph Y.-T. Leung New Jersey Institute of Technology 33.
متن کاملGuided Local Search for the Three-Dimensional Bin-Packing Problem
The three-dimensional bin packing problem is the problem of orthogonally packing a set of boxes into a minimum number of three-dimensional bins. In this paper we present a heuristic algorithm based on Guided Local Search (GLS). Starting with an upper bound on the number of bins obtained by a greedy heuristic, the presented algorithm iteratively decreases the number of bins, each time searching ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2005
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.1050.0210